Jointly Constrained Semidefinite Bilinear Programming With an Application to Dobrushin Curves
نویسندگان
چکیده
منابع مشابه
Jointly Constrained Biconvex Programming
This paper presents a branch-and-bound algorithm for minimizing the sum of a convex function in x, a convex function in y and a bilinear term in x andy over a closed set. Such an objective function is called biconvex with biconcave functions similarly defined. The feasible region of this model permits joint constraints in x and y to be expressed. The bilinear programming problem becomes a speci...
متن کاملA jointly constrained bilinear programming method for solving generalized Cournot-Pareto models
We propose a vector optimization approach to linear Cournot oligopolistic market equilibrium models where the strategy sets depend on each other. We use scalarization technique to find a Pareto efficient solution to the model by using a jointly constrained bilinear programming formulation. We then propose a decomposition branch-and-bound algorithm for globally solving the resulting bilinear pro...
متن کاملApplication of Semidefinite Programming to Circuit Partitioning
Partitioning Changhui Cris Choi Department of Management S ien es The University of Iowa Iowa City, Iowa 52242, U.S.A. Yinyu Ye Department of Management S ien es The University of Iowa Iowa City, Iowa 52242, U.S.A. August 23, 1999 Abstra t In this paper we apply Semide nite Programming (SDP) to solving the ir uit partition problem. Unlike other lo al sear h methods, we rst translate the hypergr...
متن کاملSemidefinite programming — an introduction
Interior point methods can be extended to a number of cones (self-dual homogeneous cones) • Rn (linear programming) • vectorized symmetric matrices over real numbers (semidefinite programming) • vectorized Hermitian matrices over complex numbers • vectorized Hermitian matrices over quaternions • vectorized Hermitian 3×3 matrices over octonions Grötschel, Lovász and Schrijver [3]: semidefinite p...
متن کاملA sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
In this short note a sensitivity result for quadratic semidefinite programming is presented under a weak form of second order sufficient condition. Based on this result, also the local convergence of a sequential quadratic semidefinite programming algorithm extends to this weak second order sufficient condition. Mathematical subject classification: 90C22, 90C30, 90C31, 90C55.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2939474